Approximating the Exponential, the Lanczos Method and an \tilde{O}(m)-Time Spectral Algorithm for Balanced Separator

نویسندگان

  • Lorenzo Orecchia
  • Sushant Sachdeva
  • Nisheeth K. Vishnoi
چکیده

We give a novel spectral approximation algorithm for the balanced separator problem that, given a graph G, a constant balance b ∈ (0, 1/2], and a parameter γ, either finds an Ω(b)balanced cut of conductance O( √ γ) in G, or outputs a certificate that all b-balanced cuts in G have conductance at least γ, and runs in time Õ(m). This settles the question of designing asymptotically optimal spectral algorithms for balanced separator. Our algorithm relies on a variant of the heat kernel random walk and requires, as a subroutine, an algorithm to compute exp(−L)v where L is the Laplacian of a graph related to G and v is a vector. Algorithms for computing the matrix-exponential-vector product efficiently comprise our next set of results. Our main result here is a new algorithm which computes a good approximation to exp(−A)v for a class of symmetric positive semidefinite (PSD) matrices A and a given vector u, in time roughly Õ(mA), where mA is the number of non-zero entries of A. This uses, in a non-trivial way, the breakthrough result of Spielman and Teng on inverting symmetric and diagonally-dominant matrices in Õ(mA) time. Finally, we prove that e −x can be uniformly approximated up to a small additive error, in a non-negative interval [a, b] with a polynomial of degree roughly √ b− a. While this result is of independent interest in approximation theory, we show that, via the Lanczos method from numerical analysis, it yields a simple algorithm to compute exp(−A)v for symmetric PSD matrices that runs in time roughly O(tA · √ ‖A‖), where tA is time required for the computation of the vector Aw for given vector w. As an application, we obtain a simple and practical algorithm, with output conductance O( √ γ), for balanced separator that runs in time Õ(m/√γ). This latter algorithm matches the running time, but improves on the approximation guarantee of the Evolving-Sets-based algorithm by Andersen and Peres for balanced separator.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximating Small Balanced Vertex Separators in Almost Linear Time

For a graph G with n vertices and m edges, we give a randomized Las Vegas algorithm that approximates a small balanced vertex separator of G in almost linear time. More precisely, we show the following, for any 2 3 ≤ α < 1 and any 0 < ε < 1 − α: If G contains an α-separator of size K, then our algorithm finds an (α + ε)-separator of size O(ε−1K2 log n) in time O(ε−1K3m log n) w.h.p. In particul...

متن کامل

Efficient Algorithms Using The Multiplicative Weights Update Method

Algorithms based on convex optimization, especially linear and semidefinite programming, are ubiquitous in Computer Science. While there are polynomial time algorithms known to solve such problems, quite often the running time of these algorithms is very high. Designing simpler and more efficient algorithms is important for practical impact. In this thesis, we explore applications of the Multip...

متن کامل

Probabilistic Spectral Sparsification In Sublinear Time

MIT Abstract. In this paper, we introduce a variant of spectral sparsification, called proba-bilistic (ε, δ)-spectral sparsification. Roughly speaking, it preserves the cut value of any cut (S, S c) with an 1 ± ε multiplicative error and a δ |S| additive error. We show how to produce a probabilistic (ε, δ)-spectral sparsifier with O(n log n/ε 2) edges in time˜O(n/ε 2 δ) time for unweighted undi...

متن کامل

Matrices, Moments and Quadrature: Applications to Time-Dependent Partial Differential Equations

The numerical solution of a time-dependent PDE generally involves the solution of a stiff system of ODEs arising from spatial discretization of the PDE. There are many methods in the literature for solving such systems, such as exponential propagation iterative (EPI) methods, that rely on Krylov projection to compute matrix function-vector products. Unfortunately, as spatial resolution increase...

متن کامل

Approximating Bayes Estimates by Means of the Tierney Kadane, Importance Sampling and Metropolis-Hastings within Gibbs Methods in the Poisson-Exponential Distribution: A Comparative Study

Here, we work on the problem of point estimation of the parameters of the Poisson-exponential distribution through the Bayesian and maximum likelihood methods based on complete samples. The point Bayes estimates under the symmetric squared error loss (SEL) function are approximated using three methods, namely the Tierney Kadane approximation method, the importance sampling method and the Metrop...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1111.1491  شماره 

صفحات  -

تاریخ انتشار 2011